The isomorphism conjecture for constant depth reductions
نویسندگان
چکیده
منابع مشابه
The isomorphism conjecture for constant depth reductions
For any class C closed under TC reductions, and for any measure u of uniformity containing Dlogtime, it is shown that all sets complete for C under u-uniform AC reductions are isomorphic under u-uniform AC-computable isomorphisms.
متن کاملOn the Isomorphism Conjecture for 2-DFA Reductions
The degree structure of complete sets under 2DFA reductions is investigated. It is shown that, for any class C that is closed under log-lin reductions: • All complete sets for the class C under 2DFA reductions are also complete under one-one, length-increasing 2DFA reductions and are first-order isomorphic. • The 2DFA-isomorphism conjecture is false, i.e., the complete sets under 2DFA reduction...
متن کاملThe Isomorphism Conjecture for NP
In this article, we survey the arguments and known results for and against the Isomorphism Conjecture.
متن کاملIsomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits
Given two n-variable boolean functions f and g, we study the problem of computing an ε-approximate isomorphism between them. I.e. a permutation π of the n variables such that f(x1, x2, . . . , xn) and g(xπ(1), xπ(2), . . . , xπ(n)) differ on at most an ε fraction of all boolean inputs {0, 1}. We give a randomized 2 √ n polylog(n)) algorithm that computes a 1 2polylog(n) -approximate isomorphism...
متن کاملOn the Isomorphism Conjecture for Weak Reducibilities
According to the isomorphism conjecture all NP-complete sets are polynomial-time isomorphic to each other while according to the encrypted complete set conjecture there is a p-one-way function f and an NP-complete set A such that A and f(A) are not polynomialtime isomorphic to each other. In this paper, these two conjectures are investigated for reducibilities weaker than polynomial-time. It is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2011
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2010.06.003